全文获取类型
收费全文 | 158篇 |
免费 | 2篇 |
出版年
2020年 | 3篇 |
2019年 | 6篇 |
2018年 | 8篇 |
2017年 | 5篇 |
2016年 | 5篇 |
2015年 | 5篇 |
2014年 | 3篇 |
2013年 | 60篇 |
2012年 | 2篇 |
2010年 | 1篇 |
2009年 | 1篇 |
2008年 | 3篇 |
2007年 | 1篇 |
2006年 | 2篇 |
2005年 | 1篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 4篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1975年 | 2篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1968年 | 2篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有160条查询结果,搜索用时 218 毫秒
51.
52.
Paul Zipkin 《海军后勤学研究》1982,29(2):257-270
Transportation problems with uncertain demands are useful applied models themselves, and also they represent in a formal way the problem of estimating demands for use in deterministic models. We consider the effects of using a small, aggregate model of this type in place of a larger, more detailed one. Formulation of the aggregate objective function turns out to depend on how one chooses to use (disaggregate) the solution; several alternative methods are examined. Bounds are derived on the error induced by the approximation, thus facilitating comparison of alternative aggregations. We also consider the problem of estimating demands for an aggregate-level deterministic problem. In a specific sense, it is often not the case (as one might expect) that such aggregate demands are easier to estimate than the detailed demands. This is because aggregation and centralization are not the same thing. 相似文献
53.
54.
We consider the scheduling of n jobs on m identical machines when the jobs become available for processing at ready times ai, ai, ? 0, require di time units for processing and must be completed by times bi for i = 1, 2, … n. The objective chosen is that of minimizing the total elapsed time to complete all jobs subject to the ready time and due date constraints, preemption is not allowed. We present a multi-stage solution algorithm for this problem that is based on an implicit enumeration procedure and also uses the labelling type algorithm which solves the problem when preemption is allowed. 相似文献
55.
Recent efforts to improve lower bounds in implicit enumeration algorithms for the general (n/m/G/Fmax) sequencing problem have been directed to the solution of an auxiliary single machine problem that results from the relaxation of some of the interference constraints. We develop an algorithm that obtains optimal and near optimal solutions for this relaxed problem with relatively little computational effort. We report on computational results achieved when this method is used to obtain lower bounds for the general problem. Finally, we show the equivalence of this problem to a single machine sequencing problem with earliest start and due date constraints where the objective is to minimize the maximum lateness. 相似文献
56.
Paul Zipkin 《海军后勤学研究》1986,33(4):763-774
This paper shows that one of the fundamental results of inventory theory is valid under conditions much broader than those treated previously. The result characterizes the distributions of inventory level and inventory position in the standard, continuous-time model with backorders, and leads to the relatively easy calculation of key performance measures. We treat both fixed and random leadtimes, and we examine both stationary and limiting distributions under different assumptions. We consider demand processes described by several general classes of compound-counting processes and a variety of order policies. For the stochastic-leadtime case we provide the first explicit proof of the result, assuming the leadtimes are generated according to a specific, but plausible, scenario. 相似文献
57.
58.
Like airlines and hotels, sports teams and entertainment venues can benefit from revenue management efforts for their ticket sales. Teams and entertainment venues usually offer bundles of tickets early in their selling horizon and put single‐event tickets on sale at a later date; these organizations must determine the best time to offer individual tickets because both types of ticket sales consume the same fixed inventory. We model the optimal a priori timing decision for a seller with a fixed number of identical tickets to switch from selling the tickets as fixed bundles to individual tickets to maximize the revenue realized before the start of the performance season. We assume that bundle and single‐ticket customers each arrive according to independent, nonhomogeneous Markovian death processes with a linear death rate that can vary over time and that the benefit from selling a ticket in a package is higher than from selling the ticket individually. We characterize the circumstances in which it is optimal for the seller to practice mixed bundling and when the seller should only sell bundles or individual tickets, and we establish comparative statics for the optimal timing decision for the special case of constant customer arrival rates. We extend our analytical results to find the optimal time for offering two groups of tickets with high and low demand. Finally, we apply the timing model to a data set obtained from the sports industry. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
59.
60.
We consider a robust shortest path problem when the cost coefficient is the product of two uncertain factors. We first show that the robust problem can be solved in polynomial time by a dual‐variable enumeration with shortest path problems as subproblems. We also propose a path enumeration approach using a K ‐shortest paths finding algorithm that may be efficient in many real cases. An application in hazardous materials transportation is discussed, and the solution methods are illustrated by numerical examples. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献